Random matrix analysis of multiplex networks

نویسندگان

چکیده

We investigate the spectra of adjacency matrices multiplex networks under random matrix theory (RMT) framework. Through extensive numerical experiments, we demonstrate that upon multiplexing two networks, combined network exhibit superposition Gaussian orthogonal ensemble (GOE)s for very small strength followed by a smooth transition to GOE statistics with an increase in strength. Interestingly, randomness connection architecture, introduced rewiring 1D lattice, at least one layer may govern nearest neighbor spacing distribution (NNSD) entire network, and fact, can drive from Poisson or vice versa. Notably, this transpires number corresponding small-world transition. Ergo, only being represented is enough yield network. Spectra underlying interaction have been contemplated be related dynamical behaviour complex systems, investigations presented here implications achieving better structural control systems against perturbation layers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks on Multiplex Networks

Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this letter, we extend well-known random walks to multiplexes and we introduce a new type of walk that can exist only in multiplexes. We derive exact expressions for vertex occupation time and the coverage. Finally, we show how the efficie...

متن کامل

Random Matrix Analysis of Large Relay Networks

We analyze fading interference relay networks whereM single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K single-antenna relays using half-duplex two-hop relaying. The relays do not have channel state information, perform amplify-and-forward (AF) relaying, and the destination terminals can cooperate and perform joint decodin...

متن کامل

Random matrix analysis of complex networks.

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of the adjacency matrix of various model networks, namely, random, scale-free, and small-world networks. These distributions follow the Gaussian orthogonal ensemble statistic of RMT. To probe long-range correlations in the eigenv...

متن کامل

Analysis of complex contagions in random multiplex networks

We study the diffusion of influence in random multiplex networks where links can be of r different types, and, for a given content (e.g., rumor, product, or political view), each link type is associated with a content-dependent parameter ci in [0,∞] that measures the relative bias type i links have in spreading this content. In this setting, we propose a linear threshold model of contagion wher...

متن کامل

Universality in complex networks: random matrix analysis.

We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world, and random networks follow universal Gaussian orthogonal ensemble statistics of random matrix theory. Second, we show an analogy between the onset of small-world behavior, quantified by the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica D: Nonlinear Phenomena

سال: 2022

ISSN: ['1872-8022', '0167-2789']

DOI: https://doi.org/10.1016/j.physa.2021.126457